Flexible Scheduling Through Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for Solving Scheduling Problems in Flexible Manufacturing Cells
In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملViewing Scheduling Problems through Genetic and Evolutionary Algorithms
In every system, where the resources to be allocated to a given set of tasks are limited, one is faced with scheduling problems, that heavily constrain the enterprise's productivity. The scheduling tasks are typically very complex, and although there has been a growing ow of work in the area, the solutions are not yet at the desired level of quality and eÆciency. The Genetic and Evolutionary Al...
متن کاملScheduling using Genetic Algorithms
We consider the scheduling of mixed task and data parallel modules comprising computation and communication operations. The program generation starts with a specification of the maximum degree of task and data parallelism of the method to be implemented. In several derivation steps, the degree of parallelism is adapted to a specific distributed memory machine. We present a scheduling derivation...
متن کاملscheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 1995
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.7.5_1084